Linear Difference Equations and Periodic Sequences over Finite Fields
نویسندگان
چکیده
منابع مشابه
Solving sparse linear equations over finite fields
Ahstruct-A “coordinate recurrence” method for solving sparse systems of linear equations over finite fields is described. The algorithms discussed all require O( n,( w + nl) logkn,) field operations, where nI is the maximum dimension of the coefficient matrix, w is approximately the number of field operations required to apply the matrix to a test vector, and the value of k depends on the algor...
متن کاملSecond order linear difference equations over discrete Hardy fields
Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library We shall investigate...
متن کاملLinear Complexity of Finite Field Sequences over Different Fields
In this paper we study relationships between the linear complexities of a sequence when treated as a sequence over two distinct fields. We obtain bounds for one linear complexity in the form of a constant multiple of the other, where the constant depends only on the fields, not on the particular sequence. key words: Linear complexity, stream cipher, finite field, pseudorandom sequence.
متن کاملValues of linear recurring sequences of vectors over finite fields
(1) s(k) = { vk if k ≤ n , ∑n−1 i=0 ais(k − n+ i) if k > n . We note that the elements of the sequence S can be considered as elements of the field Fqn which is an n-dimensional vector space over Fq. It is easy to see that without loss of generality we can suppose that f(0) 6= 0. Thus, it is possible to define the order of f , denoted by τ , as the least positive integer t for which f(x) divide...
متن کاملInteger Sequences and Matrices Over Finite Fields
In this expository article we collect the integer sequences that count several different types of matrices over finite fields and provide references to the Online Encyclopedia of Integer Sequences (OEIS). Section 1 contains the sequences, their generating functions, and examples. Section 2 contains the proofs of the formulas for the coefficients and the generating functions of those sequences i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Vietnamica
سال: 2015
ISSN: 0251-4184,2315-4144
DOI: 10.1007/s40306-014-0108-6